Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
نویسندگان
چکیده
منابع مشابه
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broadcast domination assigns a power f(v) 0 to each vertex v of a given graph, such that every vertex of the graph is within distance f(v) from some vertex v having f(v) 1. The optimal broadcast domination problem seeks t...
متن کاملThe cover time of random geometric graphs
We study the cover time of random geometric graphs. Let I(d) = [0, 1] denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume of the unit ball D(0, 1) in d dimensions. A random geometric graph G = G(d, r, n) in d dimensions is defined as follows: Sample n points V independently and uniformly at random from I(d). For each point x draw a ball D(...
متن کاملThe Diameter of Random Graphs
Extending some recent theorems of Klee and Larman, we prove rather sharp results about the diameter of a random graph. Among others we show that if d = d(n) > 3 and m = m(n) satisfy (log n)/d 3 log log n -> oo, 2rf_Imd'/'nd+x log n -» oo and dd~2md~l/nd — log n -» -oo then almost every graph with n labelled vertices and m edges has diameter d. About twenty years ago Erdös [7], [8] used random g...
متن کاملRandom Geometric Graph Diameter in the Unit
Let n be a positive integer, and λ > 0 a real number. Let Vn be a set of n points randomly located within the unit disk, which are mutually independent. For 1 ≤ p ≤ ∞, define Gp(λ, n) to be the graph with the vertex set Vn, in which two vertices are adjacent if and only if their `p-distance is at most λ. We call this graph a unit disk random graph. Let λ = c √ ln n/n and let X be the number of ...
متن کاملInfinite Random Geometric Graphs
We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. If V is a countable dense set in R equipped with the metric derived from the L∞-norm, then it is shown that with probability 1 such infini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2012
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-012-9710-y